Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation
نویسندگان
چکیده
Lattice rules are among the best methods to estimate integrals in a large numberof dimensions. They are part of the quasi-Monte Carlo set of tools. A new class of lattice rules,defined in a space of polynomials with coefficients in a finite field, is introduced in this paper, anda theoretical framework for these polynomial lattice rules is developed. A randomized version isstudied, implementations and criteria for selecting the parameters are discussed, and examples ofits use as a variance reduction tool in stochastic simulation are provided. Certain types of digitalnet constructions, as well as point sets constructed by taking all vectors of successive output valuesproduced by a Tausworthe random number generator, turn out to be special cases of this method.
منابع مشابه
Strong tractability of multivariate integration of arbitrary high order using digitally shifted polynomial lattice rules
In this paper we proof the existence of digitally shifted polynomial lattice rules which achieve strong tractability results for Sobolev spaces of arbitrary high smoothness. The convergence rate is shown to be best possible up to a given degree of smoothness of the integrand. Indeed we even show the existence of polynomial lattice rules which automatically adjust themselves to the smoothness of...
متن کاملGood Lattice Rules in Weighted Korobov Spaces with General Weights
We study the problem of multivariate integration and the construction of good lattice rules in weighted Korobov spaces with general weights. These spaces are not necessarily tensor products of spaces of univariate functions. Sufficient conditions for tractability and strong tractability of multivariate integration in such weighted function spaces are found. These conditions are also necessary i...
متن کاملFinite-order weights imply tractability of multivariate integration
Multivariate integration of high dimension s occurs in many applications. In many such applications, for example in finance, integrands can often be approximated by sums of functions of just a few variables. In this situation the superposition (or effective) dimension is small, and we can model the problem with finite-order weights, where the weights describe the relative importance of each dis...
متن کاملThe Approximation of Low-dimensional Integrals: Available Tools and Trends the Approximation of Low-dimensional Integrals: Available Tools and Trends
This text describes several methods to approximate multivariate integrals. Cubature formulae that are exact for a space of polyno-mials and Monte Carlo methods are the best known. More recently developed methods such as quasi-Monte Carlo methods (including lattice rules), Smolyak rules and stochastic integration rules are also described. This short note describes the contents of a session keyno...
متن کاملConstructions of general polynomial lattice rules based on the weighted star discrepancy
In this paper we study construction algorithms for polynomial lattice rules over arbitrary polynomials. Polynomial lattice rules are a special class of digital nets which yield well distributed point sets in the unit cube for numerical integration. Niederreiter obtained an existence result for polynomial lattice rules over arbitrary polynomials for which the underlying point set has a small sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Scientific Computing
دوره 24 شماره
صفحات -
تاریخ انتشار 2003